A Lexicographic Inference for Partially Preordered Belief Bases
نویسندگان
چکیده
Coherence-based approaches are quite popular to reason under inconsistency. Most of them are defined with respect to totally preordered belief bases such as the lexicographic inference which is known to have desirable properties from theoretical, practical and psychological points of view. However, partially preordered belief bases offer much more flexibility to represent efficiently incomplete knowledge and to avoid comparing unrelated pieces of information. In this paper, we propose a lexicographic inference for partially preordered belief bases that extends the classical one. On one hand, we define a natural inference relation which consists in applying classical lexicographic inference from all compatible totally preordered belief bases. On the other hand, we propose a novel cardinality-based preorder between consistent subbases. This cardinality-based preorder can be indifferently applied on partially or totally preordered belief bases. Then, applying classical inference on the preferred consistent subbases, according to this preorder, provides another lexicographic inference relation for partially preordered belief bases. Interestingly enough, we show that these two inference relations are equivalent. Lastly, a semantic characterization of these two equivalent definitions is provided.
منابع مشابه
Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of information. A number of inference relations for reasoning from partially preordered belief bases have been proposed. This paper sheds light on the following approaches: the partial binary lexicographic inference, the comp...
متن کاملProbabilistic Default Reasoning with Strict and Defeasible Conditional Constraints Probabilistic Default Reasoning with Strict and Defeasible Conditional Constraints
We present an approach to reasoning about statistical knowledge and degrees of belief, which is based on a combination of probabilistic reasoning from conditional constraints and default reasoning from conditional knowledge bases. More precisely, we generalize the notions of Pearl's entailment in system , Lehmann's lexicographic entailment, and Geffner's conditional entailment to strict and def...
متن کاملRevision over Partial Pre-orders: A Postulational Study
Belief revision is the process that incorporates, in a consistent way, a new piece of information, called input, into a belief base. When both belief bases and inputs are propositional formulas, a set of natural and rational properties, known as AGM postulates, have been proposed to define genuine revision operations. This paper addresses the following important issue : How to revise a partiall...
متن کاملRespect for Public Preferences and Iterated Backward Inference
An important approach to game theory is to examine the consequences of beliefs that rational agents may have about each other. This paper considers respect for public preferences. Consider an agent A who believes that B strictly prefers an option a to an option b. Then A respects B’s preference if A considers the choice of a “infinitely more likely” than the choice of B; equivalently, if A assi...
متن کاملOn the Semantics of Partially Ordered Bases
This paper presents first results toward the extension of possibilistic logic when the total order on formulas is replaced by a partial preorder. Few works have dealt with this matter in the past but they include some by Halpern, and Benferhat et al. Here we focus on semantic aspects, namely the construction of a partial order on interpretations from a partial order on formulas and conversely. ...
متن کامل